Transient calculations on process algebra derived Markov chains

نویسندگان

  • Allan Clark
  • Stephen Gilmore
چکیده

The process of obtaining transient measures from a Markov chain as implemented in the software, ipclib is described. The software accepts models written in PEPA, Bio-PEPA or as a Petri net. In the case of the process algebras, a rich query specification language particularly well suited for the derivation of passage-time quantiles is provided. Such measurements are obtained from the derived Markov chain through a process known as uniformisation. The authors detail how the process algebra and query specification language allow one to ensure that the passage-time calculation is valid and then the entire process through to the final calculation of the cumulative distribution and probability density functions of the passage in question. The authors also show a more generic transient measure for which the full probability distributions at specific times are required.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Taylor Expansion for the Entropy Rate of Hidden Markov Chains

We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...

متن کامل

Process Algebra and Markov Chains

This paper surveys and relates the basic concepts of process algebra and the modelling of continuous time Markov chains. It provides basic introductions to both fields, where we also study the Markov chains from an algebraic perspective, viz. that of Markov chain algebra. We then proceed to study the interrelation of reactive processes and Markov chains in this setting, and introduce the algebr...

متن کامل

A new machine replacement policy based on number of defective items and Markov chains

  A novel optimal single machine replacement policy using a single as well as a two-stage decision making process is proposed based on the quality of items produced. In a stage of this policy, if the number of defective items in a sample of produced items is more than an upper threshold, the machine is replaced. However, the machine is not replaced if the number of defective items is less than ...

متن کامل

Automated compositional Markov chain generation for a plain-old telephone system

Obtaining performance models, like Markov chains and queueing networks, for systems of signi cant complexity and magnitude is a di cult task that is usually tackled using human intelligence and experience. This holds in particular for performance models of a highly irregular nature. In this paper we argue by means of a non-trivial example – a plain-old telephone system (POTS) – that a stochasti...

متن کامل

Markovian Process Algebra : Composition and Equivalence

Markovian Process Algebra (MPA) is a process algebra enhanced with exponential timing which allows the mapping of speciications on continuous time Markov chains (CTMCs). This paper introduces a compositional approach to compute the generator matrix of the CTMC underlying a MPA speciication which consists of the parallel composition of nite state agents. Furthermore two diierent equivalence rela...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IET Software

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2009